Enhanced N+1 Parity Scheme combined with Message Logging

 Checkpointing schemes facilitate fault recovery in distributed systems. The present work extends James S Plank’s Diskless checkpointing scheme (N+1 Parity) by introducing ‘Timeout’ to checkpoint programs with high locality of reference. This mechanism enables applications with high locality of reference to take checkpoints periodically. The limitation of N+1 Parity scheme is that all the processes freeze their respective computation, while taking synchronous checkpoints. The Enhanced N+1 Parity Scheme solves this problem by introducing a new message logging technique namely partial message logging which allows asynchronous checkpointing at both sender and receiver. This paper includes the performance evaluation of proposed scheme by making use of distributed simulator test-bed. The results indicate that proposed scheme outperforms N+1 Parity Scheme. Index TermsCheckpointing, Fault tolerance, Message Logging, Performance Analysis